Comparing Defeasible Logics
نویسنده
چکیده
In this paper we seek to formally establish the similarities and differences between two formalizations of defeasible reasoning: the defeasible logics of Nute and Maier, and defeasible logics in the framework of Antoniou et al. Both families of logics have developed from earlier logics of Nute, but their development has followed different paths and they are formulated very differently. We examine these logics from the standpoint of relative inference strength – how much the logics can infer from a given theory – and relative expressiveness – how well one logic can simulate another. We identify similarities between logics in the two families and pinpoint aspects that distinguish them.
منابع مشابه
A Semantic Decomposition of Defeasible Logics
We investigate defeasible logics using a technique which decomposes the semantics of such logics into two parts: a specification of the structure of defeasible reasoning and a semantics for the meta-language in which the specification is written. We show that Nute’s Defeasible Logic corresponds to Kunen’s semantics, and develop a defeasible logic from the well-founded semantics of Van Gelder, R...
متن کاملLogics for Defeasible Argumentation
4 General features of argument-based semantics 15 4.1 The `unique status assignment' approach . . . . . . . . . . . . . . 17 4.1.1 Fixed-point de nitions . . . . . . . . . . . . . . . . . . . . 17 4.1.2 Recursive de nitions . . . . . . . . . . . . . . . . . . . . . 21 4.2 The `multiple status assignment' approach . . . . . . . . . . . . . 25 4.3 Comparing the two approaches . . . . . . . . . . ...
متن کاملAnnotated defeasible logic
Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only combine in trivial ways. This limits their usefulness in contexts where different intuitions are at play in different aspects of a problem. In particular, in ...
متن کاملPossible World Semantics for Defeasible Deontic Logic
Defeasible Deontic Logic is a simple and computationally efficient approach for the representation of normative reasoning. Traditionally defeasible logics are defined proof theoretically based on the proof conditions for the logic. While several logic programming, operational and argumentation semantics have been provided for defeasible logics, possible world semantics for (modal) defeasible lo...
متن کاملRelative Expressiveness of Well-Founded Defeasible Logics
An approach to formulating relative expressiveness of defeasible logics was introduced in [14]. In this paper we address the relative expressiveness of the well-founded defeasible logics in the framework WFDL and their relationship to the defeasible logics in the framework DL. We show that, in terms of defeasible reasoning, the logics in WFDL have greater (or equal) expressiveness than those in...
متن کامل